Interval graphs and interval orders

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Perspectives on Interval Orders and Interval Graphs

Interval orders and interval graphs are particularly natural examples of two widely studied classes of discrete structures: partially ordered sets and undirected graphs. So it is not surprising that researchers in such diverse fields as mathematics, computer science, engineering and the social sciences have investigated structural, algorithmic, enumerative, combinatorial, extremal and even expe...

متن کامل

Minimization of Open Orders Using Interval Graphs

In this paper we address an order processing optimization problem known as the Minimization of Open Stacks Problem (MOSP). This problem consists in finding the best sequence for manufacturing the different products required by costumers, in a setting where only one product can be made at a time. The objective is to minimize the maximum number of incomplete orders from costumers that are being p...

متن کامل

The niche graphs of interval orders

The niche graph of a digraph D is the (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if N D (x)∩N + D (y) 6= ∅ or N − D (x)∩ N D (y) 6= ∅, where N + D (x) (resp. N − D (x)) is the set of out-neighbors (resp. in-neighbors) of x in D. A digraph D = (V,A) is called a semiorder (or a unit interval order) if there exist ...

متن کامل

Interval orders and dimension

We show that for every interval order X , there exists an integer t so that if Y is any interval order with dimension at least t, then Y contains a subposet isomorphic to X .

متن کامل

On Generalized Interval Orders

In this paper, we introduce the notion of generalized interval order (GIO) which extends the notion of interval order in non-transitive binary relations. This allow us to extend the classical representation theorem of Fishburn in [5]. We also provide sufficient conditions which ensure the existence of the Generalized Optimal Choice Set (GOCS) of GIOs. Finally, we characterize the existence of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1985

ISSN: 0012-365X

DOI: 10.1016/0012-365x(85)90042-1